Tootfinder

Levin's and Prucnal's theorems on Medvedev's logic of finite problems
Adam P\v{r}enosil
https://arxiv.org/abs/2404.04349 https://

Levin's and Prucnal's theorems on Medvedev's logic of finite problems
The purpose of this note is to provide a transparent and unified retelling of both Skvortsov's proof of the structural completeness of Medvedev's logic of finite problems, which is a classical result originally due to Prucnal, and of Levin's proof that Medvedev's logic of finite problems is the largest extension of the (weak) Kreisel-Putnam logic with the disjunction property. Presenting both results together allows us to simplify their presentation, as they both hinge on the same lemma. There …

Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, {\DH}or{\dh}E \v{Z}ikeli\'c
https://arxiv.org/abs/2403.05386

Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs
We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel \emph{sound and complete} witnesses for LTL verification over imperative programs. Our witnesses are applicable to both universal (all runs) and existential (some run) settings. We then consider LTL formulas in which atomic propositions can be polynomial constraints and turn our focus to polynomial arithmetic programs, i.e. programs in which…

This https://arxiv.org/abs/2212.11859 has been replaced.
link: https://scholar.google.com/scholar?q=a

Librationist cum classical set theories
A librationist set theory £${}$ is developed. It descends from semantics for truth, initiated by by Kripke, Herzberger, Gupta and others. # extends the system £, of Librationist closures of the paradoxes in Logic and Logical Philosophy 21(4), 323-361, 2012. The focus is upon the paradoxes in theories of sets. A central result is that the extension #$\mathscr{HR}(\mathbf{D})$, of #, accounts for $\mathbf{NBG}$ set theory, with the global Axiom of Choice and Tarski's Axiom. Moreover, # also suc…

Distributed Optimization for Energy Grids: A Tutorial on ADMM and ALADIN
Lukas Lanza, Timm Faulwasser, Karl Worthmann
https://arxiv.org/abs/2404.03946 http…

Distributed Optimization for Energy Grids: A Tutorial on ADMM and ALADIN
The ongoing transition towards energy and power systems dominated by a large number of renewable power injections to the distribution grid poses substantial challenges for system operation, coordination, and control. Optimization-based methods for coordination and control are of substantial research interest in this context. Hence, this chapter provides a tutorial introduction of distributed optimization algorithms for energy systems with a large share of renewables. Specifically, we focus on t…

This https://arxiv.org/abs/2311.16520 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Value Approximation for Two-Player General-Sum Differential Games with State Constraints
Solving Hamilton-Jacobi-Isaacs (HJI) PDEs numerically enables equilibrial feedback control in two-player differential games, yet faces the curse of dimensionality (CoD). While physics-informed neural networks (PINNs) have shown promise in alleviating CoD in solving PDEs, vanilla PINNs fall short in learning discontinuous solutions due to their sampling nature, leading to poor safety performance of the resulting policies when values are discontinuous due to state or temporal logic constraints. I…

Disney's streaming strategy and losses led to the Disney-Peltz proxy fight but placating Peltz in Wednesday's vote to reshuffle the board may not fix the issues (Edward Ludlow/Bloomberg)
https://www.bloomberg.com/news/newsle…

Nelson Peltz’s Fight With Disney's Board Puts Focus on Streaming Business
The end of Disney’s proxy fight on Wednesday probably won’t solve the company’s streaming problem. But first...

This https://arxiv.org/abs/2402.09595 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Correctly Communicating Software: Distributed, Asynchronous, and Beyond (extended version)
Much of the software we use in everyday life consists of distributed components (running on separate cores or even computers) that collaborate through communication (by exchanging messages). It is crucial to develop robust methods that can give reliable guarantees about the behavior of such message-passing software. With a focus on session types as communication protocols and their foundations in logic, this thesis revolves around the following question: How can we push the boundaries of the lo…

Here’s how an experienced reporter can provide added value: recalling a quintessential Trump lie from seven years ago.
I wonder if the jury will learn about it.

On the critical competition between singlet exciton decay and free charge generation in non-fullerene-based organic solar cells with low energetic offsets
M. Pranav, A. Shukla, D. Moser, J. Rumeney, W. Liu, R. Wang, B. Sun, S. Smeets, N. Tokmoldin, F. Jaiser, T. Hultzsch, S. Shoaee, W. Maes, L. L\"uer, C. Brabec, K. Vandewal, D. Andrienko, S. Ludwigs, D. Neher

On the critical competition between singlet exciton decay and free charge generation in non-fullerene-based organic solar cells with low energetic offsets
In this era of non-fullerene acceptor (NFA) based organic solar cells, reducing voltage losses while maintaining high photocurrents is the holy grail of current research. Recent focus lies in understanding the manifold fundamental mechanisms in organic blends with minimal energy offsets - particularly the relationship between ionization energy offset (ΔIE) and free charge generation. We quantitatively probe this relationship in multiple NFA-based blends by mixing Y5 and Y6 NFAs with PM6 of var…

This https://arxiv.org/abs/2309.16960 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

On Generating Explanations for Reinforcement Learning Policies: An Empirical Study
Understanding a \textit{reinforcement learning} policy, which guides state-to-action mappings to maximize rewards, necessitates an accompanying explanation for human comprehension. In this paper, we introduce a set of \textit{linear temporal logic} (LTL) formulae designed to provide explanations for policies, and an algorithm for searching through those formulae for the one that best explains a given policy. Our focus is on crafting explanations that elucidate both the ultimate objectives accom…